A Sparse Matrix Multiplication Algorithm for the Reconngurable Mesh Architecture
نویسنده
چکیده
In this paper we address a sparse matrix multiplication problem posed by Schmeck et al 6]. The main contribution is an optimal run-time algorithm for for multiplying a column sparse matrix by a row sparse matrix on the reconngurable mesh architecture.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملScientiic Computing on Bulk Synchronous Parallel Architectures
Bulk synchronous parallel BSP architectures o er the prospect of achieving both scalable parallel performance and architecture independent parallel software They pro vide a robust model on which to base the future development of general purpose parallel computing systems In this paper we theoretically and experimentally analyse the e ciency with which a wide range of important scienti c computa...
متن کاملParallel Matrix Multiplication on a Linear Array with a Reconngurable Pipelined Bus System Parallel Matrix Multiplication on a Linear Array with a Reconngurable Pipelined Bus System
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity O(N), where 2 < < 3. The current best value of is less than 2.3755. We show that for all 1 p N , multiplying two N N matrices can be performed on a p-processor linear array with a reconngurable pipelined bus system (LARPBS) in O N p + N 2 p 2== log p time. This is currently the fa...
متن کاملOn Designing Communication-Intensive Algorithms for a Spanning Optical Bus Based Array
The Reconngurable Array with Spanning Optical Buses (or RASOB) architecture provides exible reconnguration and strong connectivities with low hardware and control complexities. We use a parallel implementation of the matrix transposition as well as multiplication algorithms as an example to show how the architectural capabilities can be taken advantage of in designing eecient parallel algorithms.
متن کاملcient Sparse Matrix - Matrix Multiplication on Multicore Architectures ⇤
We describe a new parallel sparse matrix-matrix multiplication algorithm in shared memory using a quadtree decomposition. Our implementation is nearly as fast as the best sequential method on one core, and scales quite well to multiple cores.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996